Ordering Genetic Algorithms and Deception
نویسندگان
چکیده
This paper considers deception in the context of ordering genetic algorithms (GAs). Order-four deceptive ordering problems are designed for absolute and relative ordering decoding. Three different crossover operators are used in both absolute and relative ordering problems, and for each combination of crossover operator and coding, the schema survival probability is calculated. Simulation results show that no single crossover operator is adequate to find the globally optimal solution in both absolute and relative ordering problems. This confirms the fundamental GA theory, that the success of a genetic algorithm depends on how well the crossover operator respects the underlying coding of the
منابع مشابه
Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملLearning Bayesian Network Structure Using Genetic Algorithm with Consideration of the Node Ordering via Principal Component Analysis
‎The most challenging task in dealing with Bayesian networks is learning their structure‎. ‎Two classical approaches are often used for learning Bayesian network structure;‎ ‎Constraint-Based method and Score-and-Search-Based one‎. ‎But neither the first nor the second one are completely satisfactory‎. ‎Therefore the heuristic search such as Genetic Alg...
متن کاملGenetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis
Part I considered the application of Walsh functions to the analysis of genetic algorithms operating on different coding-function combinations. In this paper, those meth ods are extended to permit rigorous analysis of deception by considering the expect ed disruption to schema processing caused by different genetic operators. Algebraic extensions of these metho ds are considered, and a sensitiv...
متن کاملHolder functions and deception of genetic algorithms
|We present a deception analysis for HH older functions. Our approach uses a decomposition on the Haar basis , which reeects in a natural way the HH older structure of the function. It allows to relate the deception, the HH older exponent, and some parameters of the genetic algorithms (GAs). These results prove that deception is connected to the irregularity of the tness function, and shed a ne...
متن کاملDeception Considered Harmful
A central problem in the theory of genetic algorithms is the characterization of problems that are difficult for GAs to optimize. Many attempts to characterize such problems focus on the notion of Deception, defined in terms of the static average fitness of competing schemas. This article examines the Static Building Block Hypothesis (SBBH), the underlying assumption used to define Deception. E...
متن کامل